minimum cover
英 [ˈmɪnɪməm ˈkʌvə(r)]
美 [ˈmɪnɪməm ˈkʌvər]
网络 保护层最小厚度; 最小化覆盖; 最小保护层厚度; 最小覆盖
双语例句
- Eg. the buyer should note that under the CIP term the seller is required to obtain insurance only on minimum cover.
买方应注意到，cip术语只要求卖方投保最低限度的保险险别。 - Minimum rock cover thickness is an important parameter in vertical route design of subsea tunnel; and it affects subsea tunnel cost and security.
最小岩石覆盖厚度是海底隧道垂直线路设计的重要参数，影响海底隧道的造价和安全。 - What is the minimum cover charge?
最低服务费是多少？ - P The requirements concerning minimum concrete cover shall be satisfied ( see4.4.1.2).
有关规定应涉及混凝土的最低满足标准（见4.4.1.2）。 - For concrete cast against uneven surfaces, the minimum cover should generally be increased by allowing larger deviations in design.
混凝土浇注在保护层粗糙的表面，保护层最小厚度在设计上通常允许较大误差。 - Weighted function method for minimum rock cover thickness of subsea tunnel
海底隧道最小岩石覆盖厚度的权函数法 - Minimum cover of reinforcement
钢筋保护层的最小厚度 - Meanwhile, several relational concepts are defined, and the full and necessary condition under which the standard FDs set becomes a minimum cover, and other problems are discussed.
同时，还定义了与它相关的几个概念，讨论了标准FD集F成为最小覆盖的充要条件及其它问题。 - We prove the integrality gap of minimum test set is at least 0.72 In n and the coefficient of the integrality gap of minimum test set can be as large as that of minimum set cover.
我们证明最小测试集的整性间隙至少为0.72lnn，而且最小测试集整性间隙的系数可以与最小集合覆盖的整性间隙的系数一样大。 - The second algorithm takes polynomial time in the size of input. This algorithm effectively finds a minimum cover for FDs propagated from XML keys.
第二个算法需要花费输入集合的多项式时间倍，此算法有效地计算来自XML关键字的函数依赖最小覆盖的算法。 - DNA algorithm for minimum vertex cover problem based on molecular computation
最小顶点覆盖问题的DNA分子算法 - A DNA Algorithm Based on Satisfiable Solution Space& for the Minimum Vertex Cover Problem
基于可满足解空间的DNA算法&解决最小顶点覆盖问题 - This paper mainly focuses on the following two subjects: the encoding problem and DNA computing algorithm for the minimum vertex cover problem.
本文的研究主要包括二方面的内容：DNA计算中的编码问题和DNA计算实例模型研究。 - The minimum cover thickness of steel bars for concrete structure is stipulated in the Code for anticorrosion design of industrial constructions, and it is thought that because of rein-forced concrete structure exposure to weak erosive medium, the structural durability will decrease with the reduction of reinforcement cover.
《工业建筑防腐蚀设计规范》规定了砼结构中受力钢筋的最小保护层厚度，认为对接触弱腐蚀性介质的钢筋砼结构，随着钢筋保护层的减小，结构耐久性能也随之降低。 - Minimum Cover Algorithm of the Multivalued Dependency Based on the MVD Schema Matrix
基于MVD模式矩阵的多值依赖最小覆盖算法研究 - Research on the Algorithm to Find the Minimum Cover of MVD Based on the Inverse Hypergraph of MVD
基于逆向MVD超图的求MVD最小覆盖算法研究 - The location of soleplate line and the thickness the minimum rock cover are further studied through numerical simulation.
根据数值模拟结果进一步确定象山港海底隧道的底板线位置和最小岩石覆盖厚度。 - Given attribute set and minimum cover set of functional dependencies over one relational schema, a new method for designing normalized XML schemas based on schema graph is proposed.
在给定关系模式的属性集及其函数依赖最小覆盖集的基础上，提出一种基于模式图的规范化XML模式设计方法。 - In this paper, we present two algorithms for finding a minimum cover for FDs propagated from XML keys.
提出了两个来自XML关键字的函数依赖的最小覆盖的计算算法。 - The research of the algorithm of the minimum cover for XML
基于XML最小覆盖算法的研究 - Research on algorithms to find out minimum cover and closure based on mixed hypergraph
基于混合超图的最小覆盖、闭包求解算法研究 - The Logical Algorithm of Minimum Cover of Graph
图的最小覆盖的逻辑算法 - New algorithms to find out minimum cover and closure are given and the relevant algorithms are analyzed.
并给出了最小覆盖、闭包求解的新算法，进行了相关算法分析。 - The two minimum cover problem are NP-HARD all. So we can calculate the near-optimum solution with heuristic algorithm.
研究表明，这两个最小覆盖问题都是NP-HARD问题，只能采用启发式算法求次优解。 - To seek the minimum rock cover which can meet the safety need in the course of construction and operation, will shorten the length of the tunnel, save a lot of project cost, and bring huge economic benefits.
寻求能满足海底隧道施工和运营安全的最小岩石覆盖厚度，将会缩短隧道长度，节省大量工程造价，带来巨大的经济效益。 - The minimum rock cover is one of the key-parameters in the design of hard rock sub sea tunnels.
最小岩石覆盖厚度作为海底隧道的关键参数之一，对海底隧道的修建非常重要。 - In this paper we first introduce the basic algorithms and analyze their advantages and disadvantages. And then find the relations between the minimum attribute reduction of rough set and minimum set cover problem.
本文首先介绍了经典的属性约简算法并分析了各自的优缺点，然后将粗糙集的最小属性约简问题和组合优化中的最小集合覆盖问题联系起来。 - Measure station deployment problem can be mapped to the minimum vertex cover problem. When determining the deployment station, we need to take a reasonable measure assignment to make the measurement cost is relatively low.
测量站点的部署问题可映射为最小覆盖问题，当确定部署站点后，则需求取合理的测量分配，使得测量代价相对较低。 - The minimum grouping problem is a class of some concrete problems such as the bin packing problem, the graph coloring problem, and the minimum clique cover problem.
最小分组问题是一类问题的统称，许多具体的问题，如装箱问题、图分色问题和最小团覆盖问题等，都属于最小分组问题。 - According to the limitations of the engineering analogism and numerical simulation to research the minimum rock cover of the sub sea tunnels in jointed rock masses.
考虑到工程类比法和数值模拟方法在研究节理岩体海底隧道最小岩石覆盖厚度问题上的局限性。